Multi-timed Bisimulation for Distributed Timed Automata
نویسندگان
چکیده
منابع مشابه
Simulation and Bisimulation for Probabilistic Timed Automata
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the context of the analysis of system models, with applications in the stepwise development of systems and in model reduction. In this paper, we study probabilistic timed simulation and bisimulation relations for probabilistic timed...
متن کاملA Complete Axiomatisation for Timed Automata
A proof system of timed bisimulation equivalence for timed automata is presented, based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. The proof...
متن کاملA Proof System for Timed Automata
A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimula-tion and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete ove...
متن کاملUrri 6 \ Vwhp Iru 7 Lphg $ Xwrpdwd + Xlplq / Lq : Dqj
A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete over...
متن کاملWeak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of weak bisimulation for these automata, together with an algorithm to decide it. The weak bisimulation relation is shown to be preserved when either time, or probability is abstracted away. As an application, we use wea...
متن کامل